Anisotropic Interpolation on Graphs: The Combinatorial Dirichlet Problem
نویسندگان
چکیده
The combinatorial Dirichlet problem is formulated, and an algorithm for solving it is presented. This provides an effective method for interpolating missing data on weighted graphs of arbitrary connectivity. Image processing examples are shown, and the relation to anisotropic diffusion is discussed.
منابع مشابه
A cell-centred finite-volume approximation for anisotropic diffusion operators on unstructured meshes in any space dimension
Finite-volume methods for problems involving second-order operators with full diffusion matrix can be used thanks to the definition of a discrete gradient for piecewise constant functions on unstructured meshes satisfying an orthogonality condition. This discrete gradient is shown to satisfy a strong convergence property for the interpolation of regular functions, and a weak one for functions b...
متن کاملJust chromatic exellence in fuzzy graphs
A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...
متن کاملhp-dGFEM for second-order mixed elliptic problems in polyhedra
We prove exponential rates of convergence of hp-dG interior penalty (IP) methods for second-order elliptic problems with mixed boundary conditions in polyhedra which are based on axiparallel, σ-geometric anisotropic meshes of mapped hexahedra and anisotropic polynomial degree distributions of μ-bounded variation. Compared to homogeneous Dirichlet boundary conditions in [10, 11], for problems wi...
متن کاملA Harnack inequality for Dirichlet eigenvalues
We prove a Harnack inequality for Dirichlet eigenfunctions of abelian homogeneous graphs and their convex subgraphs. We derive lower bounds for Dirichlet eigenvalues using the Harnack inequality. We also consider a randomization problem in connection with combinatorial games using Dirichlet eigenvalues.
متن کاملSome Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs
In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002